Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
941	Logic and Automata over Infinite Trees Der Fakult¨at f¨ ur Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westf¨alischen Technischen Hochschule Aachen Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 10:55:56 Formal languages Combinatorics on words Mathematical logic Models of computation Linear temporal logic Finite-state machine Tree automaton Parity game Alphabet Automata theory Mathematics Theoretical computer science
942	International Journal of Foundations of Computer Science c World Scientific Publishing Company MONA Implementation Secrets Anders Møller & Michael I. Schwartzbach Add to Reading List Source URL: www.brics.dk Language: English - Date: 2002-06-14 03:07:43 Model theory Automata theory Model checking Models of computation Binary decision diagram Boolean algebra First-order logic Finite-state machine CPU cache Mathematical logic Logic Mathematics
943	Mona & Fido: The Logic-Automaton Connection in Practice Nils Klarlund AT&T Labs{Research Florham Park, NJ Add to Reading List Source URL: www.brics.dk Language: English - Date: 2007-03-08 16:49:34 Boolean algebra Model checking Mathematics Formal methods Binary decision diagram Models of computation Finite-state machine Tree automaton Computability Automata theory Theoretical computer science Diagrams
944	October 3, [removed]:38 WSPC/INSTRUCTION FILE Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-10-03 15:38:17 Formal languages Computer science Theory of computation Ω-automaton Omega language Büchi automaton Determinacy Symbol Regular language Automata theory Theoretical computer science Mathematics
945	Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding and Stefan Repke Lehrstuhl für Informatik 7, RWTH Aachen, Aachen, Germany Abstract Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2014-02-07 10:22:52 Complexity classes Applied mathematics Nondeterministic finite automaton Deterministic finite automaton Lookahead PSPACE-complete NP Theoretical computer science Automata theory Models of computation
946	HASL: a New Approach for Performance Evaluation and Model Checking from Concepts to Experimentation Paolo Ballarini, Benoˆıt Barbot, Marie Duflot, Serge Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2015-03-25 18:43:01 Markov processes Models of computation Markov models Differential equations Petri net Probabilistic automaton Markov chain Hybrid automaton Random variable Statistics Probability and statistics Automata theory
947	Czech Technical University in Prague Faculty of Electrical Engineering Doctoral Thesis July 2014 Add to Reading List Source URL: cyber.felk.cvut.cz Language: English - Date: 2014-08-05 04:41:01 Models of computation Algorithm Mathematical logic Theoretical computer science Artificial intelligence Mathematics Multi-agent system Game theory Agent-based model Science Applied mathematics Theory of computation
948	Learning Universally Quantified Invariants of Linear Data Structures Pranav Garg1 , Christof L¨oding2 , P. Madhusudan1 , and Daniel Neider2 1 University of Illinois at Urbana-Champaign Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2013-08-07 05:31:08 Automata theory Models of computation Logic in computer science Formal methods Computability theory Satisfiability Modulo Theories Lookup table Deterministic finite automaton Decision problem Theoretical computer science Applied mathematics Mathematics
949	Playing Pushdown Parity Games in a Hurry Wladimir Fridman Martin Zimmermann Chair of Computer Science 7 Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-07-12 10:32:22 Graph theory Combinatorics Finite model theory Game theory Parity game Models of computation End Determinacy Graph Mathematics Theoretical computer science Automata theory
950	Improving the Capabilities of JFLAP Creating Effective User Interfaces in Learning for Theoretical Computer Science Ian C. McMahon Computer Science Department Duke University Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2014-06-16 14:48:07 Theoretical computer science Computer science Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Deterministic pushdown automaton Turing machine Mealy machine Algorithm Models of computation Theory of computation Automata theory

UPDATE